πŸ‘©β€πŸ’» 64063. ν˜Έν…” λ°© λ°°μ •

@Seongukbaek Posted May 15, 2022 Β· Updated May 15, 2022 Β· 2 min read

문제

Programmers - ν˜Έν…” λ°© λ°°μ •

πŸ“ Logic

private long getRoom(long room) { // ν•΄λ‹Ή 방이 아직 λ°°μ • λ°›μ§€ μ•Šμ€ 경우 if (!roomMap.containsKey(room)) { roomMap.put(room, room + 1); return room; } // ν•΄λ‹Ή 방이 이미 λ°°μ •λœ 경우, μž¬κ·€ ν˜ΈμΆœμ„ 톡해 빈 방을 μ°ΎλŠ”λ‹€. long emptyRoom = getRoom(roomMap.get(room)); roomMap.put(room, emptyRoom); return emptyRoom; }
  • μž¬κ·€ ν˜ΈμΆœμ„ 톡해 빈 방을 μ°Ύμ•„ roomMap 에 κ°±μ‹ ν•΄μ€€λ‹€.
  • 이λ₯Ό 톡해 ν•œ λ²ˆμ— 빈 방을 배정해쀄 수 μžˆλ‹€.

πŸ“„ CODE

μ½”λ“œ 보기/μ ‘κΈ°πŸ’«
import java.util.*; class Solution { Map<Long, Long> roomMap = new HashMap<>(); public long[] solution(long k, long[] room_number) { long[] answer = new long[room_number.length]; for (int i = 0; i < room_number.length; i++) answer[i] = getRoom(room_number[i]); return answer; } private long getRoom(long room) { // ν•΄λ‹Ή 방이 아직 λ°°μ • λ°›μ§€ μ•Šμ€ 경우 if (!roomMap.containsKey(room)) { roomMap.put(room, room + 1); return room; } // ν•΄λ‹Ή 방이 이미 λ°°μ •λœ 경우, μž¬κ·€ ν˜ΈμΆœμ„ 톡해 빈 방을 μ°ΎλŠ”λ‹€. long emptyRoom = getRoom(roomMap.get(room)); roomMap.put(room, emptyRoom); return emptyRoom; } }

✏️ Review

  • Map 을 μ‚¬μš©ν•΄ λ°© λ²ˆν˜Έμ™€ λ°°μ • κ°€λŠ₯ν•œ λ°© 번호λ₯Ό μ €μž₯ν•˜μ—¬ 두 값이 κ°™μ•„μ§ˆ λ•ŒκΉŒμ§€ νƒμƒ‰ν•˜λ©΄μ„œ λ°°μ • κ°€λŠ₯ν•œ 방을 λ°°μ •ν•΄μ£ΌλŠ” λ°©μ‹μœΌλ‘œ κ΅¬ν˜„ν•˜μ˜€μ§€λ§Œ, μ‹œκ°„μ΄ˆκ³Όκ°€ λ°œμƒν–ˆλ‹€.
  • 단좕을 μœ„ν•΄μ„œλŠ” 1 -> 2 -> 3 -> 4 -> 5 κ°€ μ•„λ‹ˆλΌ 1 -> 5 둜 λ°© 배정을 λ°”λ‘œ 받을 수 μžˆλ„λ‘ ν•΄μ£Όμ–΄μ•Ό ν–ˆλ‹€.
@Seongukbaek
배우고 μ •λ¦¬ν•˜κ³  κ³΅μœ ν•˜λŠ” λŒ€ν•™μƒ λ°±μ„±μš±μž…λ‹ˆλ‹€ πŸ˜€